A Hybrid Gray Wolf Weed Algorithm for Flexible Job-shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling
Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...
متن کاملA Hybrid Algorithm for Job Shop Scheduling Problem
The Job Shop Scheduling Problem (JSSP) is regarded as one of the most challenging issues by the research community in this field due to its complexity. This paper presents a hybrid algorithm called H-PSO-SA for JSSP which is a mixture of two computational artificial intelligence algorithms: Particle Swarm Optimization and Simulated Annealing. In order to demonstrate efficiency of the proposed h...
متن کاملSingle Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...
متن کاملMultiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1828/1/012162